首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   9841篇
  免费   309篇
  国内免费   98篇
化学   5839篇
晶体学   126篇
力学   413篇
数学   1912篇
物理学   1958篇
  2021年   93篇
  2020年   109篇
  2019年   98篇
  2018年   97篇
  2017年   88篇
  2016年   178篇
  2015年   232篇
  2014年   227篇
  2013年   733篇
  2012年   417篇
  2011年   491篇
  2010年   306篇
  2009年   341篇
  2008年   482篇
  2007年   494篇
  2006年   486篇
  2005年   376篇
  2004年   359篇
  2003年   324篇
  2002年   342篇
  2001年   160篇
  2000年   162篇
  1999年   141篇
  1998年   120篇
  1997年   144篇
  1996年   168篇
  1995年   131篇
  1994年   132篇
  1993年   138篇
  1992年   109篇
  1991年   123篇
  1990年   126篇
  1989年   101篇
  1988年   101篇
  1987年   97篇
  1986年   82篇
  1985年   98篇
  1984年   109篇
  1983年   91篇
  1982年   91篇
  1981年   95篇
  1980年   84篇
  1979年   91篇
  1978年   90篇
  1977年   85篇
  1976年   92篇
  1975年   72篇
  1974年   96篇
  1972年   119篇
  1971年   74篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
Aequationes mathematicae - In this paper, we establish a new class of dynamic inequalities of Hardy’s type which generalize and improve some recent results given in the literature. More...  相似文献   
2.
A new family of distorted ribbon-shaped nanographenes was designed, synthesized, and their optical and electrochemical properties were evaluated, pointing out an unprecedented correlation between their structural characteristics and the two-photon absorption (TPA) responses and electrochemical band gaps. Three nanographene ribbons have been prepared: a seven-membered-ring-containing nanographene presenting a tropone moiety at the edge, its full-carbon analogue, and a purely hexagonal one. We have found that the TPA cross-sections and the electrochemical band gaps of the seven-membered-ring-containing compounds are higher and lower, respectively, than those of the fully hexagonal polycyclic aromatic hydrocarbon (PAH). Interestingly, the inclusion of additional curvature has a positive effect in terms of non-linear optical properties of those ribbons.  相似文献   
3.
4.
Journal of Solid State Electrochemistry - A novel material was developed using sol-gel chemistry and an environmental-friendly grafting process of clay nanoparticles. In a previous work of our...  相似文献   
5.
6.
7.
8.
9.
The human macrophage galactose-type lectin (MGL), expressed on macrophages and dendritic cells (DCs), modulates distinct immune cell responses by recognizing N-acetylgalactosamine (GalNAc) containing structures present on pathogens, self-glycoproteins, and tumor cells. Herein, NMR spectroscopy and molecular dynamics (MD) simulations were used to investigate the structural preferences of MGL against different GalNAc-containing structures derived from the blood group A antigen, the Forssman antigen, and the GM2 glycolipid. NMR spectroscopic analysis of the MGL carbohydrate recognition domain (MGL-CRD, C181-H316) in the absence and presence of methyl α-GalNAc (α-MeGalNAc), a simple monosaccharide, shows that the MGL-CRD is highly dynamic and its structure is strongly altered upon ligand binding. This plasticity of the MGL-CRD structure explains the ability of MGL to accommodate different GalNAc-containing molecules. However, key differences are observed in the recognition process depending on whether the GalNAc is part of the blood group A antigen, the Forssman antigen, or GM2-derived structures. These results are in accordance with molecular dynamics simulations that suggest the existence of a distinct MGL binding mechanism depending on the context of GalNAc moiety presentation. These results afford new perspectives for the rational design of GalNAc modifications that fine tune MGL immune responses in distinct biological contexts, especially in malignancy.  相似文献   
10.
A path decomposition of a graph G is a collection of edge-disjoint paths of G that covers the edge set of G. Gallai (1968) conjectured that every connected graph on n vertices admits a path decomposition of cardinality at most ?(n+1)2?. Gallai’s Conjecture has been verified for many classes of graphs. In particular, Lovász (1968) verified this conjecture for graphs with at most one vertex with even degree, and Pyber (1996) verified it for graphs in which every cycle contains a vertex with odd degree. Recently, Bonamy and Perrett (2016) verified Gallai’s Conjecture for graphs with maximum degree at most 5, and Botler et al. (2017) verified it for graphs with treewidth at most 3. In this paper, we verify Gallai’s Conjecture for triangle-free planar graphs.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号